Multiply partition regular matrices
نویسندگان
چکیده
Let A be a finite matrix with rational entries. We say that A is doubly image partition regular if whenever the set N of positive integers is finitely coloured, there exists ~x such that the entries of A~x are all the same colour (or monochromatic) and also, the entries of ~x are monochromatic. Which matrices are doubly image partition regular? More generally, we say that a pair of matrices (A,B), where A and B have the same number of rows, is doubly kernel partition regular if whenever N is finitely coloured, there exist vectors ~x and ~y, each monochromatic, such that A~x + B~y = ~0. (So the case above is the case when B is the negative of the identity matrix.) There is an obvious sufficient condition for the pair (A,B) to be doubly kernel partition regular, namely that there exists a positive rational c such that the matrix M = ( A cB ) is kernel partition regular. (That is, whenever N is finitely coloured, there exists monochromatic ~x such thatM~x = ~0.) Our aim in this paper is to show that this sufficient condition is also necessary. As a consequence we have that a matrix A is doubly image partition regular if and only if there is a positive rational c such that the matrix ( A −cI ) is kernel partition regular, where I is the identity matrix of the appropriate size. Email addresses: [email protected] (Dennis Davenport), [email protected] (Neil Hindman), [email protected] (Imre Leader), [email protected] (Dona Strauss) This author acknowledges support received from the National Science Foundation (USA) under grant DMS-1160566. We also prove extensions to the case of several matrices.
منابع مشابه
Matrices centrally image partition regular near 0
Hindman and Leader first investigated Ramsey theoretic properties near 0 for dense subsemigroups of (R,+). Following them, the notion of image partition regularity near zero for matrices was introduced by De and Hindman. It was also shown there that like image partition regularity over N, the main source of infinite image partition regular matrices near zero are Milliken–Taylor matrices. But ex...
متن کاملInfinite Partition Regular Matrices , II – Extending the Finite Results
A finite or infinite matrix A is image partition regular provided that whenever N is finitely colored, there must be some ~x with entries from N such that all entries of A~x are in the same color class. Using the algebraic structure of the StoneČech compactification βN of N, along with a good deal of elementary combinatorics, we investigate the degree to which the known characterizations of fin...
متن کاملInfinite Partition Regular Matrices: Solutions in Central Sets
A finite or infinite matrix A is image partition regular provided that whenever N is finitely colored, there must be some ~x with entries from N such that all entries of A~x are in the same color class. In contrast to the finite case, infinite image partition regular matrices seem very hard to analyze: they do not enjoy the closure and consistency properties of the finite case, and it is diffic...
متن کاملPartition Regularity without the Columns Property
A finite or infinite matrix A with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector x with Ax = 0. Many of the classical theorems of Ramsey Theory may naturally be interpreted as assertions that particular matrices are partition regular. In the finite case, Rado proved that a matrix is partition regular if and onl...
متن کاملUniversally Image Partition Regularity
Many of the classical results of Ramsey Theory, for example Schur’s Theorem, van der Waerden’s Theorem, Finite Sums Theorem, are naturally stated in terms of image partition regularity of matrices. Many characterizations are known of image partition regularity over N and other subsemigroups of (R,+). In this paper we introduce a new notion which we call universally image partition regular matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 322 شماره
صفحات -
تاریخ انتشار 2014